On Resolvability Parameters of Some Wheel-Related Graphs
نویسندگان
چکیده
منابع مشابه
The Distance Matrices of Some Graphs Related to Wheel Graphs
A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. All graphs considered here are simple and connected. LetG be a simple connected graph with vertex set V(G) and edge set E(G).The distance between two vertices u, V ∈ V(G) is denoted by d uV and is defined as the length of the shortest path between u and V ...
متن کاملOn connected resolvability of graphs
For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a connected resolving set for G if distinct vertices of G have distinct representations with respect to W and the...
متن کاملOperations on Graphs Increasing Some Graph Parameters
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set G n of graphs with n vertices and m edges and some operations on graphs within G n that are monotone with respect to these partial orders. The partial orders under consideration include those related with some Laplacian characteristics of graphs as well as with some probabilis...
متن کامل2-Size Resolvability in Graphs
A vertex u in a graph G resolves a pair of distinct vertices x, y of G if the distance between u and x is different from the distance between u and y. A set W of vertices in G resolves the graph G if every pair of distinct vertices of G is resolved by some vertices in W . The metric dimension of a graph, denoted by dim(G), is the smallest cardinality of a resolving set. A resolving set W for a ...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemistry
سال: 2019
ISSN: 2090-9063,2090-9071
DOI: 10.1155/2019/9259032